منابع مشابه
Fountain Codes
Fountain codes are record-breaking sparse-graph codes for channels with erasures – such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file-transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back-channel is ...
متن کاملCorruption Resilient Fountain Codes
A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruptio...
متن کاملLinearly-Coupled Fountain Codes
Network-coded multiple access (NCMA) is a communication scheme for wireless multiple-access networks where physical-layer network coding (PNC) is employed. In NCMA, a user encodes and spreads its message into multiple packets. Time is slotted and multiple users transmit packets (one packet each) simultaneously in each timeslot. A sink node aims to decode the messages of all the users from the s...
متن کاملFountain Codes and Invertible Matrices
This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding ...
متن کاملOn Sequential Locally Repairable Codes
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2016
ISSN: 1089-7798,1558-2558,2373-7891
DOI: 10.1109/lcomm.2016.2574355